Search results for "Stability problem"

showing 4 items of 4 documents

A memetic approach to discrete tomography from noisy projections

2010

Discrete tomography deals with the reconstruction of images from very few projections, which is, in the general case, an NP-hard problem. This paper describes a new memetic reconstruction algorithm. It generates a set of initial images by network flows, related to two of the input projections, and lets them evolve towards a possible solution, by using crossover and mutation. Switch and compactness operators improve the quality of the reconstructed images during each generation, while the selection of the best images addresses the evolution to an optimal result. One of the most important issues in discrete tomography is known as the stability problem and it is tackled here, in the case of no…

Settore INF/01 - InformaticaCrossoverComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONEvolutionary algorithmDiscrete tomographyReconstruction algorithmImage processingIterative reconstructionStability problemArtificial IntelligenceRobustness (computer science)Signal ProcessingMemetic algorithmComputer Vision and Pattern RecognitionDiscrete tomographyAlgorithmSoftwareEvolutionary reconstruction.MathematicsPattern Recognition
researchProduct

An Island Strategy for Memetic Discrete Tomography Reconstruction

2014

In this paper we present a parallel island model memetic algorithm for binary discrete tomography reconstruction that uses only four projections without any further a priori information. The underlying combination strategy consists in separated populations of agents that evolve by means of different processes. Agents progress towards a possible solution by using genetic operators, switch and a particular compactness operator. A guided migration scheme is applied to select suitable migrants by considering both their own and their sub-population fitness. That is, from time to time, we allow some individuals to transfer to different subpopulations. The benefits of this paradigm were tested in …

Mathematical optimizationInformation Systems and ManagementCorrectnessSettore INF/01 - InformaticaComputationMigration strategyBinary numberIterative reconstructionMemetic island modelNoisy projectionStability problemComputer Science ApplicationsTheoretical Computer ScienceOperator (computer programming)Artificial IntelligenceControl and Systems EngineeringImage reconstructionA priori and a posterioriMemetic algorithmAlgorithmDiscrete tomographySoftwareParallel discrete tomographyMathematics
researchProduct

A genetic algorithm for discrete tomography reconstruction

2007

The aim of this paper is the description of an experiment carried out to verify the robustness of two different approaches for the reconstruction of convex polyominoes in discrete tomography. This is a new field of research, because it differs from classic computerized tomography, and several problems are still open. In particular, the stability problem is tackled by using both a modified version of a known algorithm and a new genetic approach. The effect of both, instrumental and quantization noises has been considered too. © 2007 Springer Science+Business Media, LLC.

Mathematical optimizationPolyominoComputer scienceQuantization (signal processing)Physics::Medical PhysicsComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONRegular polygonDiscrete tomographyStability problemComputer Science ApplicationsTheoretical Computer ScienceGenetic algorithmArtificial IntelligenceHardware and ArchitectureTomographyAlgorithmDiscrete tomographySoftwareGenetic Programming and Evolvable Machines
researchProduct

An experimental study of the stability problem in discrete tomography

2003

This paper introduces the topic of discrete tomography, briefly showing its main applications, algorithms and new prospects of research. It focuses on the still open problem of stability, facing it from an experimental point of view. In particular an extensive simulation lets verify the robustness of a well known reconstruction technique for binary convex objects, calculating the probability of finding solutions compatible with a given set of noisy projections. © 2005 Elsevier Ltd. All rights reserved.

Mathematical optimizationSettore INF/01 - InformaticaOpen problemApplied MathematicsRegular polygonBinary numberConvex reconstructionDiscrete tomographyStability problemRobustness (computer science)Discrete Mathematics and CombinatoricsDiscrete tomographyDiscrete Mathematics and CombinatoricMathematics
researchProduct